GASP: Answer Set Programming with Lazy Grounding
نویسندگان
چکیده
In this paper we present a novel methodology to compute stable models in Answer Set Programming. The process is performed with a bottom-up approach that does not require the preprocessing of the typical grounding phase. The implementation is completely in Prolog and Constraint Logic Programming over finite domains.
منابع مشابه
Compiling Answer Set Programs into Event-Driven Action Rules
This paper presents a compilation scheme, called ASP2AR, for translating ASP into event-driven action rules. For an ASP program, the generated program maintains a partial answer set as a pair of sets of tuples (called IN and OUT ) and propagates updates to these sets using action rules. To facilitate propagation, we encode each set as a finite-domain variable and treat additions of tuples into ...
متن کاملLazy-Grounding for Answer Set Programs with External Source Access
HEX-programs enrich the well-known Answer Set Programming (ASP) paradigm. In HEX, problems are solved using nonmonotonic logic programs with bidirectional access to external sources. ASP evaluation is traditionally based on grounding the input program first, but recent advances in lazy-grounding make the latter also interesting for HEX, as the grounding bottleneck of ASP may be avoided. We expl...
متن کاملLazy model expansion by incremental grounding BROES DE CAT and MARC DENECKER
Model expansion is a widely accepted way to solve a range of problems. It is achieved by encoding the problem in a declarative (logic) language such that structures which satisfy the specification are solutions to the problem. Model expansion is researched in domains like Knowledge Representation and Answer Set Programming. The ground-andsolve methodology tackles model expansion by converting t...
متن کاملAnswer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a preliminary grounding phase. The implementation of the framework can be completely realized within the framework of Constraint Logic Programming over finite domains. The use of a high level language for the implementation and...
متن کاملLazy Model Expansion by Incremental Grounding
Ground-and-solve methods used in state-of-the-art Answer Set Programming and model expansion systems proceed by rewriting the problem specification into a ground format and afterwards applying search. A disadvantage of such approaches is that the rewriting step blows up the original specification for large input domains and is unfeasible in case of infinite domains. In this paper we describe a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 96 شماره
صفحات -
تاریخ انتشار 2009